Best monotone degree conditions for binding number
نویسندگان
چکیده
منابع مشابه
Best monotone degree conditions for binding number
We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b > 0. Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is hamiltonian is best possible.
متن کاملBest Monotone Degree Bounds for Various Graph Parameters
We identify best monotone degree bounds for the chromatic number and independence number of a graph. These bounds are best in the same sense as Chvátal’s hamiltonian degree condition. 1 Terminology and Notation We consider only undirected graphs without loops or multiple edges. Our terminology and notation will be standard except as indicated, and a good reference for any undefined terms is [14...
متن کاملThe saturation number for the length of degree monotone paths
A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G). This parameter, inspired by the well-known ErdősSzekeres theorem, has been studied by the authors in two earlier papers. Here we consider a saturation p...
متن کاملMonotone separations for constant degree
We prove a separation between monotone and general arithmetic formulas for polynomials of constant degree. We give an example of a polynomial C in n variables and degree k which is computable by an arithmetic formula of size O(k2n2), but every monotone formula computing C requires size (n/kc)Ω(log k), with c ∈ (0, 1). This also gives a separation between monotone and homogeneous formulas, for p...
متن کاملDegree conditions for hamiltonicity: Counting the number of missing edges
In 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+ d(v) n for every pair of nonadjacent vertices u and v, then G is hamiltonian. In this note we strengthen Ore’s theorem as follows: we determine the maximum number of pairs of nonadjacent vertices that can have degree sum less than n (i.e. violate Ore’s condition) but still imply that the graph is hamiltonian. Some o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.04.034